Beyond P^(NP) - NEXP
نویسندگان
چکیده
Buhrman and Torenvliet created an oracle relative to which P NP = NEXP and thus P NP = P NEXP. Their proof uses a delicate nite injury argument that leads to a nonrecursive oracle. We simplify their proof removing the injury to create a recursive oracle making P NP = NEXP. In addition, in our construction we can make P = UP = NP \ coNP. This leads to the curious situation where LOW(NP) = P but LOW(P NP) = NEXP, and the complete p m-degree for P NP collapses to a p-isomorphism type.
منابع مشابه
Unconditional Lower Bounds against Advice
We show several unconditional lower bounds for exponential time classes against polynomial time classes with advice, including: 1. For any constant c, NEXP 6⊆ P c]/nc 2. For any constant c, MAEXP 6⊆ MA/nc 3. BPEXP 6⊆ BPP/n It was previously unknown even whether NEXP ⊆ NP/n. For the probabilistic classes, no lower bounds for uniform exponential time against advice were known before. We also cons...
متن کاملDaniel Apon 1 From IP = PSPACE to NP = PCP ( log , 1 ) : NEXP has multi - prover interactive protocols
If you’ve read the notes on the history of the PCP theorem referenced in Lecture 19 [3], you will already be familiar with the excitement that surrounded discoveries such as IP=PSPACE and NP=PCP(log, 1). Taken alone, however, these two theorems might seem at most cursorily related to one another. The earlier discovery of IP=PSPACE deals with a much stronger class, assuming the polynomial hierar...
متن کاملCons-free Programming with Immutable Functions
We investigate the power of non-determinism in purely functional programming languages with higher-order types. Specifically, we set out to characterise the hierarchy NP ( NEXP ( NEXP ( · · · ( NEXP ( · · · solely in terms of higher-typed, purely functional programs. Although the work is incomplete, we present an initial approach using cons-free programs with immutable functions.
متن کاملSplitting NP-Complete Sets
We show that a set is m-autoreducible if and only if it is m-mitotic. This solves a long standing open question in a surprising way. As a consequence of this unconditional result and recent work by Glaßer et al., complete sets for all of the following complexity classes are m-mitotic: NP, coNP, ⊕P, PSPACE, and NEXP, as well as all levels of PH, MODPH, and the Boolean hierarchy over NP. In the c...
متن کاملRedundancy in Complete Sets
We show that a set is m-autoreducible if and only if it is m-mitotic. This solves a long standing open question in a surprising way. As a consequence of this unconditional result and recent work by Glaßer et al. [11], complete sets for all of the following complexity classes are m-mitotic: NP, coNP, ⊕P, PSPACE, and NEXP, as well as all levels of PH, MODPH, and the Boolean hierarchy over NP. In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995